Using Dead Ants to improve the robustness and adaptability of AntNet routing algorithm
نویسندگان
چکیده
This paper studies the characteristics and behavior of AntNet routing algorithm and introduces two complementary strategies to improve its adaptability and robustness particularly under unpredicted traffic conditions such as network failure or sudden burst of network traffic. Both of the proposed strategies use the knowledge of backward ants with undesirable trip times called Dead Ants to balance the two important concepts of exploration and exploitation in the algorithm. Although in AntNet routing algorithm Dead Ants are neglected and considered as algorithm overhead, our proposal uses the experience of these ants to provide a much accurate representation of the existing sourcedestination paths and the current traffic pattern. In the sense of routing process, gathered data of each Dead Ant is analyzed through a fuzzy inference engine to extract valuable routing information. This information is then refined according to their validity and added to the system’s routing knowledge. In the sense of traffic monitoring, arriving Dead Ants and their delays are analyzed to detect undesirable traffic fluctuations and used as an event to trigger appropriate recovery action. To have a comprehensive performance evaluation, our proposed algorithm is simulated and compared with three different versions of AntNet routing algorithm namely: Standard AntNet, Helping Ants and FLAR. Simulations are run on four different network topologies under various traffic patterns. As simulation results show, improvements of our algorithm are apparent in both normal and challenging traffic conditions.
منابع مشابه
Investigation of antnet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem
Antnet is a software agent based routing algorithm that is influenced by the unsophisticated and individual ants emergent behaviour. Ants (nothing but software agents) in antnet are used to collect traffic information and to update the probabilistic distance vector routing table entries. One of the major problems with antnet is called stagnation and adaptability. This occurs, when the network f...
متن کاملThe Antnet Routing Algorithm - A Modified Version
Antnet is an agent based routing algorithm that is influenced from the unsophisticated and individual ant’s emergent behaviour. Ants (software agents) are used in antnet to collect information and to update the probabilistic distance vector routing table entries. Modified antnet algorithm has been introduced, which improve the throughput and average delay. Results shows that by detecting and dr...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملAntnet: Modified Routing Algorithm for Packet Switched Networks
Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Network and Computer Applications
دوره 44 شماره
صفحات -
تاریخ انتشار 2014